Finding the boundary nodes of a Euclidean graph
نویسندگان
چکیده
12:00–12:55 Registration 12:55–13:00 Opening remarks, chaired by Makoto Namiki (Toho Univ.) Yasufumi Saruwatari (Univ. of Tsukuba) Komei Fukuda (ETH Zurich) 13:00–14:20 Session 1, chaired by Yasuko Matsui (Tokai Univ.) Finding the boundary nodes of a Euclidean graph Reinhardt Euler (Univ. of Brest) Deza’s last problems Yohji Akama (Tohoku Univ.) 14:35–15:55 Session 2, chaired by Tomomi Matsui (Tokyo Inst. Tech.) Optimizing illusion for ambiguous cylinders Kokichi Sugihara (Meiji Univ.) Cone of metrics, quasi-metrics and hemimetrics Mathieu Dutour (Rudjer Boskovic Inst.) 16:10–17:30 Session 3, chaired by Akihisa Tamura (Keio Univ.) Kempe equivalence of 3-edge-colorings in cubic graphs Kenta Ozeki (Yokohama National Univ.) On discrete midpoint convexity Kazuo Murota (Tokyo Metropolitan Univ.) 18:00–20:00 Wine Party
منابع مشابه
Sampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کاملکاربرد تئوری گرف در مطالعات اکولوژی سیمای سرزمین نمونه موردی: سنجش پیوستگی زیستگاههای کلانشهر ملبورن
A new method to quantify, monitore and assess ecological structures and functions is the application of graph theory. In ecology, this theory demonstrates its suitable application in assessment of ecological connectivity. Connectivity is the structural attribute of landscape which facilitates the species movement among their habitats. Using graph theory, this paper aims to assess the connectivi...
متن کامل